Refactoring Long Running Transactions: A Case Study
نویسندگان
چکیده
Managing transactions is a key issue in Service Oriented Computing where particular relevance is given to the so called Long Running Transactions (LRT). Here, we show how to apply a formal approach to the specification and refactoring of LRT. Specifically, we consider a methodology arising on process calculi and show how it can be applied to a case study.
منابع مشابه
Refactoring Long Running Transactions
Sagas calculi have been proposed to specify distributed Long Running Transactions (LRT) and, in previous work, a subset of naive sagas has been encoded in the Signal Calculus (SC) to enable their use in service-oriented systems. Here, we promote a formal approach to the refactoring of LRT represented in SC so that distributed LRT designed in the Business Process Modelling Notation (BPMN) can be...
متن کاملModeling of Compensation in Long-Running Transactions
nowadays, the most controversial issue is transaction in database systems or web services. Specifically, in the area of service-oriented computing, where business transactions always need long periods of time to finish. In the case of a failure rollback, which is the traditional method, it will not be enough and not suitable for handling errors during long running transactions. As a substitute,...
متن کاملDesign and verification of long-running transactions in a timed framework
Long–running transactions consist of tasks which may be executed sequentially and in parallel, may contain sub–tasks, and may require to be completed before a deadline. These transactions are not atomic and, in case of executions which cannot be completed, a compensation mechanism must be provided. In this paper we develop a model of Communicating Hierarchical Timed Automata suitable to describ...
متن کاملModeling Long-Running Transactions with Communicating Hierarchical Timed Automata
Long-running transactions consist of tasks which may be executed sequentially and in parallel, may contain sub-tasks, and may require to be completed before a deadline. These transactions are not atomic and, in case of executions which cannot be completed, a compensation mechanism must be provided. In this paper we develop a model of Hierarchical Timed Automata suitable to describe the aspects ...
متن کاملEdit Transactions: Dynamically Scoped Change Sets for Controlled Updates in Live Programming
Live programming environments enable programmers to edit a running program and obtain immediate feedback on each individual change. The liveness quality is valued by programmers to help work in small steps and continuously add or correct small functionality while maintaining the impression of a direct connection between each edit operation and its manifestation at run-time. Such immediacy may c...
متن کامل